Sampling Without Probabilistic Model

نویسندگان

  • MICHAEL BEER
  • Michael Beer
چکیده

In this paper a novel technique for random vector sampling starting from rare data is presented. This model-free sampling technique is developed to operate without a probabilistic model. Instead of estimating a distribution function, the information contained in a given small sample is extracted directly to produce the sampling result as a second sample of considerably larger size that completely reflects the properties of the original small sample. As a further enhancement, the new sampling technique is extended to processing imprecise data. Model-free sampling can be coupled to stochastic structural analysis and safety assessment by application to input data or to result data. In the case of limited data, for instance, due to a high numerical cost of the underlying computational model, the novel technique can be applied to generate a proper estimation of stochastic structural responses and, thanks to a sound reproduction of distribution tails, of structural reliability. In this context it can provide a basis for increasing the numerical efficiency of Monte Carlo simulations in computational stochastic mechanics. The usefulness of the model-free sampling technique is underlined by means of numerical examples.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic Model-Building Genetic Algorithms in Permutation Representation Domain Using Edge Histogram

Recently, there has been a growing interest in developing evolutionary algorithms based on probabilistic modeling. In this scheme, the offspring population is generated according to the estimated probability density model of the parent instead of using recombination and mutation operators. In this paper, we have proposed probabilistic model-building genetic algorithms (PMBGAs) in permutation re...

متن کامل

Solving Sequence Problems by Building and Sampling Edge Histograms

Recently, there has been a growing interest in developing evolutionary algorithms based on probabilistic modeling. In this scheme, the offspring population is generated according to the estimated probability density model of the parent instead of using recombination and mutation operators. In this paper, we have proposed probabilistic model-building genetic algorithms (PMBGAs) in permutation re...

متن کامل

Using Edge Histogram Models to Solve Permutation Problems with Probabilistic Model-Building Genetic Algorithms

Recently, there has been a growing interest in probabilistic model-building genetic algorithms (PMBGAs), which replace traditional variation operators of genetic and evolutionary algorithms by building and sampling a probabilistic model of promising solutions. In this paper we propose a PMBGA that uses edge histogram based sampling algorithms (EHBSAs) to solve problems with candidate solutions ...

متن کامل

Efficient Probabilistic Tracking of User Goal and Dialog History for Spoken Dialog Systems

In this paper, we describe Dynamic Probabilistic Ontology Trees, a new probabilistic model to track dialog state in a dialog system. Our model captures both the user goal and the history of user dialog acts using a unified Bayesian Network. We perform efficient inference using a form of blocked Gibbs sampling designed to exploit the structure of the model. Evaluation on a corpus of dialogs from...

متن کامل

Compression of Probabilistic Graphs using Tree Decompositions

Probabilistic graphs are a natural model for uncertainty in networks, such as biological, social, road, and communication networks. There has been much recent research in query processing on such graphs, mainly via sampling-based algorithms, yet proposed techniques still have significant costs in terms of execution time. In this paper, we present an alternative approach to the processing of pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006